Verification via Tableaux
نویسنده
چکیده
We present a set of seminar notes on basic concepts and results on automated and semi-automated veriication of correctness and validation of software systems (protocols) via the method of tableaux, often called semantic tableaux. Special emphasis is on comparison of various ways of formalization of the concept of a `proof', on the example of the classical rst-order logic.
منابع مشابه
Relational Dual Tableaux: Foundations and Applications
The origin of dual tableaux goes back to the paper [RAS60] of Rasiowa and Sikorski, where a cut-free deduction system for the classical first-order logic has been presented. Systems in the Rasiowa-Sikorski style are top-down validity checkers and they are dual to the well known tableau systems. The common language of most of relational dual tableaux is the logic of binary relations which was in...
متن کاملProof Output and Transformation for Disconnection Tableaux
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs. In this paper we present a new method of transforming disconnection tableau proofs found by the prover system DCTP into a series of resolution inferences representing a resolution refutation of the proof problem.
متن کاملWho is Pointing When to Whom? On the Automated Verification of Linked List Structures
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each other via pointers. Our logic is focused on specifying properties about the dynamic evolution (such as creation, adaptation, and removal) of such pointer structures. The semantics is based on automata on infinite words, e...
متن کاملLTL Semantic Tableaux and Alternating $\omega$-automata via Linear Factors
Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable ω-automata and then applying model checking. We revisit Vardi’s transformation of an LTL formula to an alternating ω-automaton and Wolper’s LTL tableau method for satisfiability checking. We ob...
متن کاملGenerating Logical Specifications from Requirements Models for Deduction-based Formal Verification
The work concerns automatic generation of logical specifications from requirements models. Logical specifications obtained in such a way can be subjected to formal verification using deductive reasoning. Formal verification concerns correctness of a model behaviour. Reliability of the requirements engineering is essential for all phases of software development processes. Deductive reasoning is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997